Routing Using Implicit Connection Graphs - VLSI Design, 1996. Proceedings., Ninth International Conference on

نویسنده

  • S. Q. Zheng
چکیده

We introduce a framework for a class of algorithms solving shortest path related problems, such as the one-to-one shortest path problem, the one-to-many shortest paths pmblem and the minimum spanning tree problem, in the presence of obstacles. For these algorithms, the search space is restricted to a sparse strong connection graph which is implicitly represented and its searched portion is constructed incrementally on-the-fly during search. The time and space requirements of these algorithm essentially depend on aictual search behavior. These algorithms are suitable for large VLSI design applications with many obstacles.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Allocation and Binding in Data Path Synthesis Using a Genetic Algorithm Approach - VLSI Design, 1996. Proceedings., Ninth International Conference on

A technique for allocatzon and binding for data path synthesis (DPS) using a Genetic Algorithm (GA) approach has been developed. The proposed genetic algorithm uses a non-conventional crossover mechanism, relying on a novel force directed data path binding completion algorithm. The proposed technique has a number of features such as acceptance of some design pammeters fnom the user, use of a bu...

متن کامل

Additive Schwarz for the Schur Complement Method Additive Schwarz for the Schur Complement Method

Submitted to the proceedings of the ninth international conference on domain decomposition methods (Bergen-Norway-1996).

متن کامل

Avoiding Message-Dependent Deadlock in Network-Based Systems on Chip

ion, and flexible network configuration,” IEEE Trans-actions on Computer-Aided Design of Integrated Circuits andSystems, vol. 24, no. 1, pp. 4–17, 2005.[4] M. Sgroi, M. Sheets, A. Mihal, et al., “Addressing the system-on-a-chip interconnect woes through communication-baseddesign,” in Proceedings of the 38th Design Automation Confer-ence (DAC ’01), pp. 667–672, Las Vegas,...

متن کامل

An Integrated Hardware-Software Cosimulation Environment for Heterogeneous Systems Prototyping - Design Automation Conference, 1995. Proceedings of the ASP-DAC '95/CHDL '95/VLSI '95., IFIP Intern

In this paper, we present a hardware-software cosimulation environment for heterogeneous systems. To be an efficient system verification environment for the rapid prototyping of heterogeneous systems, the environment provides interface transparency, simulation acceleration, smooth transition to cosynthesis, and integrated user interface and internal representation. As an experimental example, a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004